Minimizing Information-Centric Convergence Cost in Multi-Agent Agreement Problems

نویسندگان

  • Kiran Lakkaraju
  • Les Gasser
چکیده

The basic paradigm of learning has shifted significantly, from single agents that learn in single, static environments, to collective learning: multiple, interacting agents with diverse goals learning from each other across different local environments. Instances of collective learning abound in sensor networks, peer-to-peer systems, distributed recommender systems, and in social systems in general. A critical, but unexplored, activity in collective learning is information gathering: the exchange of information about other agents’ individual preferences, that will guide collective decision making processes. A set of tradeoffs exists between the amount of information agents gather, the effort of this information gathering, and agents individual and collective performance. Reducing the amount of information gathered may reduce information costs, but reduced information can produce interpretation errors that create suboptimal behavior in the agents and the collective. In this paper we define and study the impact of these tradeoffs using the well known “Generalized Simple Majority” decision process in the model problem of norm emergence, a type of multi-agent agreement process in which agents converge to a common strategy. We present a new metric,“Information-Centric Convergence Cost”(ICCC), that combines information cost with the cost of time, and a new decision process, “Generalized Simple Sampled Majority,” and we study these in several agent network topologies. Surprisingly, we find that as the level of information gathering is reduced the amount of error increases non-linearly, giving a non-linear impact on performance. Thus the careful manipulation of information-processing effort can minimize ICCC while still achieving quick norm emergence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of trajectories in infinite horizon optimization

In this paper, we investigate the convergence of a sequence of minimizing trajectories in infinite horizon optimization problems. The convergence is considered in the sense of ideals and their particular case called the statistical convergence. The optimality is defined as a total cost over the infinite horizon.

متن کامل

A class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions

 In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...

متن کامل

A Parallel Stochastic Approximation Method for Nonconvex Multi-Agent Optimization Problems

Consider the problem of minimizing the expected value of a (possibly nonconvex) cost function parameterized by a random (vector) variable, when the expectation cannot be computed accurately (e.g., because the statistics of the random variables are unknown and/or the computational complexity is prohibitive). Classical sample stochastic gradient methods for solving this problem may empirically su...

متن کامل

A Mechanism of Generating Joint Plans for Self-interested Agents, and by the Agents

Generating joint plans for multiple self-interested agents is one of the most challenging problems in AI, since complications arise when each agent brings into a multi-agent system its personal abilities and utilities. Some fully centralized approaches (which require agents to fully reveal their private information) have been proposed for the plan synthesis problem in the literature. However, i...

متن کامل

Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning

In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009